Column generation for stochastic green telecommunication network planning with switchable base stations

We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

INTELLIGENT DECISION ALGORITHM FOR FAULT DETECTION AND ITS APPLICATION

ＩＮＴＥＬＬＩＧＥＮＴＤＥＣＩＳＩＯＮＡＬＧＯＲＩＴＨＭＦＯＲＦＡＵＬＴＤＥＴＥＣＴＩＯＮＡＮＤＩＴＳＡＰＰＬＩＣＡＴＩＯＮＷｕＪｉａｎｊｕｎ;ＺｈａｎｇＹｕｌｉｎ;ＣｈｅｎＱｉｚｈｉ（ＤｅｐａｒｔｍｅｎｔｏｆＡｅｒｏｓｐａｃｅＴｅｃｈｎｏｌｏｇｙ,...     

面向钢铁企业的分布式智能化管理信息系统YHWG

我们开发的“分布式智能化管理信息系统ＹＨＷＧ”由钢种辅助设计专家系统、转炉炉衬监测诊断专家系统和低合金钢及转炉炉衬信息管理系统等部分组成,目前已在武汉钢铁公司得到应用,取得了良好的经济效益     

多功能智能仪及其在卫星通信中的应用

本文报告了最新研制的多功能智能仪,它有较多接口:键盘,显示器,打印机,A/D,D/A,并行口,串行口,内存空间达64k。多功能智能仪有广泛用途,文中给出了它在卫星通信地球站中两个应用实例及有关程序框图。     

人才结构系统分析的目标规划方法

本文把马尔可夫过程和目标规划结合起来,提出人才结构系统分析的单项控制和多项控制,并在单项控制模型的基础上发展成了多项控制模型,加强了模型的可信度和通用性。     

空间飞行器及其推进系统智能自治控制技术分析

空间飞行器及其推进系统由于系统本身的复杂性、工作环境的不确定性和未知性等,利用传统的现代控制理论与方法对其进行控制十分困难。文中深入分析了智能自治控制系统内涵、功能及其构成框架,解析了空间飞行器RemoteAgent智能自治控制系统的基本构成,对空间飞行器推进系统重构问题进行了应用分析,对研究和发展我国空间飞行器的智能自治控制系统有一定的借鉴作用。     

Agent战场视景仿真视点智能控制方法

为了实现战场视景仿真中视点的智能控制,使视点能够自动选择运动方式,根据场景中发生的热点事件自动切换观察目标并且自动调整观察位置及角度,将Agent的思想引入视点控制策略的设计,提出了一种基于Agent的战场视景仿真视点的智能控制方法,针对热点事件搜索智能体、观察目标选择智能体和观察方式控制智能体的智能体行为算法,以及多...     

复杂环境下基于多目标粒子群的DWA路径规划算法

针对机器人在障碍物分布密集的复杂环境中运行时,动态窗口法(dynamic window approach,DWA)易出现避障失败或规划不合理的情况,提出一种基于多目标粒子群优化算法(multi-objective particle swarm optimization,MOPSO)的改进DWA规划算法。在建立多障碍物环境覆盖模型的基础上,提出一种障碍物密集度的判断方法;优化DWA算法中的子评价函数;利用改进的MOPSO算法实现DWA权重系数的动态调整,将权重系数的自适应变化问题转化为多目标优化问题;根据路径规划的要求将安全距离和速度作为优化目标,并使用改进的MOPSO算法对相应的多目标优化模型进行优化求解。仿真结果表明,该算法使机器人有效地通过障碍〖BHDWG8,WK10YQ,DK1*2,WK1*2D〗〖XCLXY.TIF;%129%129〗听语音 聊科研与作者互动 物密集区的同时兼顾了运行的安全性和速度,具有更好的路径规划效果。     

舰载对陆巡航导弹规划航路点间距离的计算分析

针对舰载对陆巡航导弹在实际飞行中,其航迹需要参考近似大地线的航线,在充分考虑导弹由海对陆的航路规划过程基础上,提出了易于编程、精度有所改进的空间两点间大地距离的计算方法.该方法在考虑高程的地球椭球模型参数的求取基础上,利用Bowring反解公式重新推导了顾及高程的空间航路点间的计算公式.相关算例表明,该方法提高了导弹规...